Horizontal runs in domino tilings
نویسندگان
چکیده
منابع مشابه
Spaces of Domino Tilings
We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...
متن کاملDomino Tilings with Barriers
In this paper, we continue the study of domino-tilings of Aztec diamonds. In particular, we look at certain ways of placing ``barriers'' in the Aztec diamond, with the constraint that no domino may cross a barrier. Remarkably, the number of constrained tilings is independent of the placement of the barriers. We do not know of a simple combinatorial explanation of this fact; our proof uses the J...
متن کاملIntersecting Domino Tilings
In this note we consider an Erdős-Ko-Rado analog of tilings. Namely given two tilings of a common region we say that they intersect if they have at least one tile in the same location. We show that for a domino tiling of the 2×n strip that the largest collection of tilings which pairwise intersect are counted by the Fibonacci numbers. We also solve the problem for tilings of the 3×(2n) strip us...
متن کاملHeight Function on Domino Tilings
We first define the height function on a domino tiling (as done in [1]) and state some of its basic properties. We then revisit the coupling function and relate it to Green’s function, which allows us to conclude that the coupling function converges in the limit to an analytic function with a pole. Using this, we do a general second moment calculation via the proof found in [1] which writes the...
متن کاملLambda-determinants and Domino-tilings
Consider the 2n-by-2n matrix M = (mi, j) i, j=1 with mi, j = 1 for i, j satisfying |2i−2n−1|+ |2 j−2n−1|≤ 2n and mi, j = 0 for all other i, j, consisting of a central diamond of 1’s surrounded by 0’s. When n ≥ 4, the λ determinant of the matrix M (as introduced by Robbins and Rumsey [7]) is not well-defined. However, if we replace the 0’s by t’s, we get a matrix whose λ -determinant is welldefi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2014
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.09554